Packing trees in complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
For a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vertex-disjoint subgraphs of G that each are isomorphic to a member of S and that together contain all vertices of G. If G allows a covering (locally bijective homomorphism) to a graph H, i.e., a vertex mapping f : VG → VH satisfying the property that f(u)f(v) belongs to EH whenever the edge uv belongs to EG...
متن کاملA note on packing trees into complete bipartite graphs and on fishburn's conjecture
The sequence of graphs { G1, G2, . . . , G,} is said to be packed into a graph G if G has edge disjoint subgraphs HI, Hz, . . . , H, such that Hi G Gj, j = 1, . . . , t. We say that a graph G is m-panarboreal if each tree on m vertices, T,, can be packed into G. Gyarfas and Lehel [3] conjectured that if z is any tree of order i then the sequence of trees {T,, T3, . . . , T,} can be packed into ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملPacking Plane Spanning Trees and Paths in Complete Geometric Graphs
We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?
متن کاملPacking Short Plane Spanning Trees in Complete Geometric Graphs
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is very long (when compared to the minimum length needed to obtain a spanning graph). We consider two different approaches: first we show an almost optimal centra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2252